Reshaping Access Patterns for Improving Data Locality
نویسنده
چکیده
In this paper, we present a method to construct a loop transformation that simultaneously reshapes the access patterns of several occurrences of multidimensional arrays along certain desired access directions. First, the method determines a direction through the original iteration space along which these desired access directions are induced. Subsequently, a unimodular transformation is constructed that changes the iteration space traversal accordingly. Finally, data dependences are accounted for. In particular, this reshaping method can be used to improve data locality in a program.
منابع مشابه
SHRD: Improving Spatial Locality in Flash Storage Accesses by Sequentializing in Host and Randomizing in Device
Recent advances in flash memory technology have reduced the cost-per-bit of flash storage devices, thereby enabling the development of large-capacity SSDs. However, two major concerns arise in designing SSDs. The first is the poor performance of random writes, and the second is the large size of the internal DRAM of an SSD. Although the previously proposed demand map loading technique can reduc...
متن کاملLocality Optimizations For Adaptive Irregular Scientific Codes
Irregular scientific codes experience poor cache performance due to their memory access patterns. We examine several data and computation locality transformations including GPART, a new technique based on hierarchical clustering. GPART constructs quality partitions quickly by clustering multiple neighboring nodes in a few passes, with priority on nodes with high degree. Overhead is kept low by ...
متن کاملEvaluating Locality Optimizations For Adaptive Irregular Scientific Codes
Irregular scientific codes experience poor cache performance due to their memory access patterns. Researchers have proposed several data and computation transformations to improve locality in irregular scientific codes. We experimentally compare their performance and present GPART, a new technique based on hierarchical clustering. Quality partitions are constructed quickly by clustering multipl...
متن کاملA Selective Hardware / Compiler Approach for Improving
The widening gap between processor and memory speeds renders data locality optimization a very important issue in compilers. Throughout the years hardware designers and compiler writers focused on optimizing data cache locality using intelligent cache management mechanisms and program-level transformations, respectively. While pure compiler-oriented techniques are quite successful in optimizing...
متن کاملA clustering-based prefetching scheme on a Web cache environment
Web prefetching is an attractive solution to reduce the network resources consumed by Web services as well as the access latencies perceived by Web users. Unlike Web caching, which exploits the temporal locality, Web prefetching utilizes the spatial locality of Web objects. Specifically, Web prefetching fetches objects that are likely to be accessed in the near future and stores them in advance...
متن کامل